Choosing initial values for the EM algorithm for finite mixtures

نویسندگان

  • Dimitris Karlis
  • Evdokia Xekalaki
چکیده

The EM algorithm is the standard tool for maximum likelihood estimation in )nite mixture models. The main drawbacks of the EM algorithm are its slow convergence and the dependence of the solution on both the stopping criterion and the initial values used. The problems referring to slow convergence and the choice of a stopping criterion have been dealt with in literature and the present paper deals with the initial value problem for the EM algorithm. The aim of this paper is to compare several methods for choosing initial values for the EM algorithm in the case of )nite mixtures as well as to propose some new methods based on modi)cations of existing ones. The cases of )nite normal mixtures with common variance and )nite Poisson mixtures are examined through a simulation study. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Initializing normal mixtures of densities

It is well known that log-likelihood function for finite mixtures usually has local maxima and therefore the iterative EM algorithm for maximum-likelihood estimation of mixtures may be starting-point dependent. In the present paper we propose a method of choosing initial parameters of mixtures which includes two stages: (a) computation of nonparametric optimally smoothed kernel estimate of the ...

متن کامل

The Noise Component in Model-based Clustering

Model-based cluster analysis is a statistical tool used to investigate groupstructures in data. Finite mixtures of Gaussian distributions are a popular device used to model elliptical shaped clusters. Estim ation of mixtures of Gaussians is usually based on the maximum likelihood method. However, for a wide class of finite mixtures, including Gaussians, maximum likelihood estimates are not robu...

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

Investigating the Effect of Joint Geometry of the Gas Tungsten Arc Welding Process on the Residual Stress and Distortion using the Finite Element Method

Although a few models have been proposed for 3D simulation of different welding processes, 2D models are still more effective in design goals, thus more popular due to the short-time analysis. In this research, replacing "time" by the "third dimension of place", the gas tungsten arc welding process was simulated by the finite element method in two dimensions and in a short time with acceptable ...

متن کامل

EM algorithm for image segmentation initialized by a tree structure scheme

In this correspondence, the objective is to segment vector images, which are modeled as multivariate finite mixtures. The underlying images are characterized by Markov random fields (MRFs), and the applied segmentation procedure is based on the expectation-maximization (EM) technique. We propose an initialization procedure that does not require any prior information and yet provides excellent i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2003